Three Complexity Results on Coloring Pk-Free Graphs
نویسندگان
چکیده
We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., graphs that do not contain a path on k vertices as an induced subgraph. First of all, we show that the pre-coloring extension version of 5-coloring remains NP-complete when restricted to P6-free graphs. Recent results of Hoàng et al. imply that this problem is polynomially solvable on P5-free graphs. Secondly, we show that the pre-coloring extension version of 3-coloring is polynomially solvable for P6-free graphs. This implies a simpler algorithm for checking the 3-colorability of P6-free graphs than the algorithm given by Randerath and Schiermeyer. Finally, we prove that 6-coloring is NP-complete for P7-free graphs. This problem was known to be polynomially solvable for P5-free graphs and NP-complete for P8-free graphs, so there remains one open case. © 2012 Elsevier Ltd. All rights reserved.
منابع مشابه
Three complexity results on coloring P k - free graphs I
We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., graphs that do not contain a path on k vertices as an induced subgraph. First of all, we show that the pre-coloring extension version of 5-coloring remains NP-complete when restricted to P6-free graphs. Recent results of Hoàng et al. imply that this problem is polynomially solvable on P5-free graph...
متن کاملImproved Complexity Results on k-Coloring P t -Free Graphs
A graph is H-free if it does not contain an induced subgraph isomorphic to H . We denote by Pk and Ck the path and the cycle on k vertices, respectively. In this paper, we prove that 4-COLORING is NP-complete for P7-free graphs, and that 5-COLORING is NP-complete for P6-free graphs. These two results improve all previous results on kcoloring Pt-free graphs, and almost complete the classificatio...
متن کاملUpdating the complexity status of coloring graphs without a fixed induced linear forest
A graph is H-free if it does not contain an induced subgraph isomorphic to the graph H. The graph Pk denotes a path on k vertices. The `-Coloring problem is the problem to decide whether a graph can be colored with at most ` colors such that adjacent vertices receive different colors. We show that 4-Coloring is NP-complete for P8free graphs. This improves a result of Le, Randerath, and Schierme...
متن کاملCertifying coloring algorithms for graphs without long induced paths
Let Pk be a path, Ck a cycle on k vertices, and Kk,k a complete bipartite graph with k vertices on each side of the bipartition. We prove that (1) for any integers k, t > 0 and a graph H there are finitely many subgraph minimal graphs with no induced Pk and Kt,t that are not Hcolorable and (2) for any integer k > 4 there are finitely many subgraph minimal graphs with no induced Pk that are not ...
متن کاملPk-freeness implies small dichromatic number
We propose a purely combinatorial quadratic time algorithm that for any n-vertex Pk-free tournament T , where Pk is a directed path of length k, finds in T a transitive subset of order n c k log(k)2 . As a byproduct of our method, we obtain subcubic O(n 1− c k log(k)2 )-approximation algorithm for the optimal acyclic coloring problem on Pk-free tournaments. Our results are tight up to the log(k...
متن کامل